package com.zhaofan.other;

import org.junit.Test;

/**
 * https://leetcode-cn.com/problems/median-of-two-sorted-arrays/
 */
public class No4 {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int mid=(nums1.length+nums2.length)/2;

        while(true){
            int mid1=nums1.length/2,mid2=nums2.length/2;
//            if(mid1)
        }


//        return 0;
    }
}
